Mathematics of Operations Research

Results: 1289



#Item
551Mathematical analysis / Computational geometry / Operations research / Diagrams / Discrete geometry / Voronoi diagram / Global optimization / Halton sequence / Genetic algorithm / Mathematical optimization / Statistics / Mathematics

22nd National Conference of the Australian Society for Operations Research, Adelaide, Australia, 1–6 December 2013 www.asor.org.au/conferences/asor2013 Directed Voronoi Search: a method for bound constrained global opt

Add to Reading List

Source URL: www.asor.org.au

Language: English - Date: 2013-12-05 00:43:44
552Mathematical economics / Applied mathematics / Artificial intelligence / Economics / Mechanism design / Percentile / Price of anarchy / Facility location / Algorithmic game theory / Game theory / Operations research / Science

Analysis and Optimization of Multi-dimensional Percentile Mechanisms Xin Sui Craig Boutilier Tuomas Sandholm

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2013-04-27 17:56:41
553Operations research / Electronic filter / Traffic flow / Fluid dynamics / Electronics / Computing / Mathematics / Network flow / Aerodynamics / Flow network

Supporting Openness in Distributed Multimedia Systems Frank Eliassen * University of Tromso Dept. of Computer Science 9037 Tromso Norway

Add to Reading List

Source URL: www.nik.no

Language: English - Date: 2002-05-08 04:37:10
554Image processing / Operations research / Travelling salesman problem / Voronoi diagram / Stippling / Halftone / Ordered dithering / Concorde TSP Solver / Drawing / Mathematics / Theoretical computer science / Applied mathematics

TSP Art Craig S. Kaplan School of Computer Science University of Waterloo [removed]

Add to Reading List

Source URL: archive.bridgesmathart.org

Language: English - Date: 2013-06-27 11:09:47
555Applied mathematics / Science / Operations research / Mathematics / Cybernetics / Genetic programming / Behavioral ecology / John Koza / Foraging / Genetic algorithms / Mathematical optimization / Evolutionary algorithms

EVOLUTION OF FOOD FORAGING STRATEGIES FOR THE CARIBBEAN ANOLIS LIZARD USING GENETIC PROGRAMMING John R. Koza Computer Science Department Margaret Jacks Hall Stanford University

Add to Reading List

Source URL: www.genetic-programming.com

Language: English - Date: 2006-11-17 21:18:33
556Network flow / Operations research / Routing algorithms / Network theory / Bellman–Ford algorithm / Shortest path problem / Dynamic programming / Induced path / Maximum flow problem / Mathematics / Graph theory / Theoretical computer science

COMS21103 Given a (weighted, directed) graph G and a pair of vertices s and t, we would like to find a shortest path from s to t. A fundamental task with many applications:

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-01-08 09:09:07
557Heuristics / Operations research / Combinatorial optimization / NP-complete problems / Mathematical optimization / Heuristic function / Algorithm / Approximation algorithm / Greedy algorithm / Mathematics / Theoretical computer science / Applied mathematics

Minimal Landmarks for Optimal Delete-Free Planning Patrik Haslum, John Slaney and Sylvie Thi´ebaux Optimisation Research Group, NICTA Research School of Computer Science, Australian National University firstname.lastnam

Add to Reading List

Source URL: users.cecs.anu.edu.au

Language: English - Date: 2012-08-12 05:41:58
558Operations research / Mathematical optimization / Combinatorial optimization / Decision theory / NP-complete problems / Genetic algorithm / Knapsack problem / Tabu search / Multi-criteria decision analysis / Applied mathematics / Theoretical computer science / Mathematics

Development of a Natural Resource Management Investment Decision Support System Marinoni, O., Higgins, A., Hajkowicz S. CSIRO Sustainable Ecosystems, 4067 St Lucia Qld Email: Keywords: Water mana

Add to Reading List

Source URL: www.mssanz.org.au

Language: English - Date: 2013-01-16 21:02:38
559Combinatorial optimization / Mathematics / Applied mathematics / Heuristic function / Admissible heuristic / Heuristic / Branch and bound / Linear programming relaxation / Relaxation / Mathematical optimization / Heuristics / Operations research

Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu

Add to Reading List

Source URL: gki.informatik.uni-freiburg.de

Language: English - Date: 2010-05-29 10:18:47
UPDATE